Impact of Technology and Innovation Advisory Services

This report identifies and reviews literature that evaluates the impacts of technology and innovation advisory services. These services provide information, technical assistance, consulting, mentoring, and other services to support enterprises in adopting and deploying new technologies and in commercialising innovations. Examples include the: Manufacturing Advisory Service (UK), the Manufacturing Extension Partnership (USA), and the Industrial Research Assistance Program (Canada). Technology and innovation advisory services are also provided by technology centres and other business assistance programmes. Such services are typically targeted at small and medium-sized enterprises. A defining capability of technology and innovation advisory services is the offer of expert one-on-one guidance to individual companies through extension staff, field offices, or dispersed technology centres. The available studies generally find that technology and innovation advisory services provide positive benefits for participating firms. The types of benefits achieved include reductions in costs, improved quality, reduced waste and improved environmental performance, higher productivity, and new product development and innovation. Net benefits achieved are typically relatively modest, although commensurate with the relatively small amounts of public funding usually invested in technology and innovation advisory services. More intense and customised services can improve results. Applying best practices in the operation and delivery of technology and innovation services, including attention to outreach, staff capability, long-term engagement, flexibility, organisational stability, and linkage with other services, increases the likelihood of programme effectiveness and impact

Entangled Quantum States Generated by Shor's Factoring Algorithm

The intermediate quantum states of multiple qubits, generated during the operation of Shor's factoring algorithm are analyzed. Their entanglement is evaluated using the Groverian measure. It is found that the entanglement is generated during the pre-processing stage of the algorithm and remains nearly constant during the quantum Fourier transform stage. The entanglement is found to be correlated with the speedup achieved by the quantum algorithm compared to classical algorithms.Comment: 7 pages, 4 figures submitted to Phys. Rev.

ZnJ2 Is a Member of a Large Chaperone Family in the Chloroplast of Photosynthetic Organisms that Features a DnaJ-Like Zn-Finger Domain.

Photosynthesis is performed by large complexes, composed of subunits encoded by the nuclear and chloroplast genomes. Assembly is assisted by general and target-specific chaperones, but their mode of action is yet unclear. We formerly showed that ZnJ2 is an algal chaperone resembling BSD2 from land plants. In algae, it co-migrates with the rbcL transcript on chloroplast polysomes, suggesting it contributes to the de-novo synthesis of RbcL (Doron et al., 2014). ZnJ2 contains four CXXCXGXG motifs, comprising a canonical domain typical also of DnaJ-type I (DNAJA). It contributes to the binding of protein substrates to DnaK and promotes an independent oxidoreductase activity (Mattoo et al., 2014). To examine whether ZnJ2 has oxidoreductase activity, we used the RNaseA assay, which measures the oxidation-dependent reactivation of reduced-denatured RNaseA. Although ZnJ2 assisted the native refolding of reduced-denatured RNaseA, its activity was restricted to an oxidizing environment. Thus, ZnJ2 did not carry the exclusive responsibility for the formation of disulfide bridges, but contributed to the stabilization of its target polypeptides, until they reached their native state. A ZnJ2 cysteine deficient mutant maintained a similar holding chaperone activity as the wild-type and did not induce the formation of disulfide bonds. ZnJ2 is devoid of a J-domain. It thus does not belong to the J-domain co-chaperones that target protein substrates to DnaK. As expected, in vitro, its aggregation-prevention activity was not synergic to the ATP-fueled action of DnaK/DnaJ/GrpE in assisting the native refolding of denatured malate dehydrogenase, nor did it show an independent refolding activity. A phylogenetic analysis showed that ZnJ2 and BSD2 from land plants, are two different proteins belonging to a larger group containing a cysteine-rich domain, that also includes the DNAJAs. Members of this family are apparently involved in specific assembly of photosynthetic complexes in the chloroplast

Erawatch (European research area support)

Issued as final reportErawatch Network ASB

Reduction of Soil-Borne Plant Pathogens Using Lime and Ammonia Evolved from Broiler Litter

In laboratory and micro-plots simulations and in a commercial greenhouse, soil ammonia (NH3) and pH were manipulated as means to control soil-borne fungal pathogens and nematodes. Soil ammonification capacity was increased by applying low C/N ratio broiler litter at 1–8% (w/w). Soil pH was increased using lime at 0.5–1% (w/w). This reduced fungi (Fusarium oxysporum f. sp. dianthi and Sclerotium rolfsii) and root-knot nematode (Meloidogyne javanica) in lab tests below detection. In a commercial greenhouse, broiler litter (25 Mg ha−1) and lime (12.5 Mg ha−1) addition to soil in combination with solarization significantly reduced M. javanica induced root galling of tomato test plants from 47% in the control plots (solarization only) to 7% in treated plots. Root galling index of pepper plants, measured 178 days after planting in the treated and control plots, were 0.8 and 1.5, respectively, which was statistically significantly different. However, the numbers of nematode juveniles in the root zone soil counted 83 and 127 days after pepper planting were not significantly different between treatments. Pepper fruit yield was not different between treatments. Soil disinfection and curing was completed within one month, and by the time of bell-pepper planting the pH and ammonia values were normal

A Minimum-Labeling Approach for Reconstructing Protein Networks across Multiple Conditions

The sheer amounts of biological data that are generated in recent years have driven the development of network analysis tools to facilitate the interpretation and representation of these data. A fundamental challenge in this domain is the reconstruction of a protein-protein subnetwork that underlies a process of interest from a genome-wide screen of associated genes. Despite intense work in this area, current algorithmic approaches are largely limited to analyzing a single screen and are, thus, unable to account for information on condition-specific genes, or reveal the dynamics (over time or condition) of the process in question. Here we propose a novel formulation for network reconstruction from multiple-condition data and devise an efficient integer program solution for it. We apply our algorithm to analyze the response to influenza infection in humans over time as well as to analyze a pair of ER export related screens in humans. By comparing to an extant, single-condition tool we demonstrate the power of our new approach in integrating data from multiple conditions in a compact and coherent manner, capturing the dynamics of the underlying processes.Comment: Peer-reviewed and presented as part of the 13th Workshop on Algorithms in Bioinformatics (WABI2013

Noise effect on Grover algorithm

The decoherence effect on Grover algorithm has been studied numerically through a noise modelled by a depolarizing channel. Two types of error are introduced characterizing the qubit time evolution and gate application, so the noise is directly related to the quantum network construction. The numerical simulation concludes an exponential damping law for the successive probability of the maxima as time increases. We have obtained an allowed-error law for the algorithm: the error threshold for the allowed noise behaves as Eth(N) ~ 1/N1.1 (N being the size of the data set). As the power of N is almost one, we consider the Grover algorithm as robust to a certain extent against decoherence. This law also provides an absolute threshold: if the free evolution error is greater than 0.043, Grover algorithm does not work for any number of qubits affected by the present error model. The improvement in the probability of success, in the case of two qubits has been illustrated by using a fault-tolerant encoding of the initial state by means of the [[7,1,3]] quantum code.Comment: Accepted to be published in Eur. Phys. J. D (2008